package com.leetcode.util;

public class Utils {
	private int maxs(int... a) {
		int max = a[0];
		for (int i=1; i<a.length; i++) if (a[i] > max) max = a[i];
		return max;
	}
	
	private class TreeNode {
		TreeNode left;
		TreeNode right;
		int val;
		public TreeNode(int val) {
			this.val = val;
		}
	}
	
	private class TreeLinkNode {
		TreeLinkNode left;
		TreeLinkNode right;
		TreeLinkNode next;
		int val;
		public TreeLinkNode(int val) {
			this.val = val;
		}
	}
}
